On the partial terminal steiner tree problemHSIEH, Sun-Yuan; GAO, Huang-Ming.Journal of supercomputing. 2007, Vol 41, Num 1, pp 41-52, issn 0920-8542, 12 p.Article

A modified Melzak procedure for computing node-weighted Steiner treesUNDERWOOD, A.Networks (New York, NY). 1996, Vol 27, Num 1, pp 73-79, issn 0028-3045Article

The k-Steiner ratio in the rectilinear planeBORCHERS, A; DU, D.-Z; BIAO GAO et al.Journal of algorithms (Print). 1998, Vol 29, Num 1, pp 1-17, issn 0196-6774Article

Fast heuristics for the Steiner tree problem with revenues, budget and hop constraintsCOSTA, Alysson M; CORDEAU, Jean-Francois; LAPORTE, Gilbert et al.European journal of operational research. 2008, Vol 190, Num 1, pp 68-78, issn 0377-2217, 11 p.Article

Steiner tree compilation of multicast under differentiated services constraintsVRONTIS, Stavros; XYNOGALAS, Stavros; SYKAS, Efstathios et al.Journal of communication and networks. 2007, Vol 9, Num 1, pp 84-92, issn 1229-2370, 9 p.Article

The sequential sum problem and performance bounds on the greedy algorithm for the on-line steiner problemMILLER, Zevi; PRITIKIN, Dan; PERKEL, Manley et al.Networks (New York, NY). 2005, Vol 45, Num 3, pp 143-164, issn 0028-3045, 22 p.Article

Canonical forms and algorithms for steiner trees in uniform orientation metricsBRAZIL, M; THOMAS, D. A; WENG, J. F et al.Algorithmica. 2006, Vol 44, Num 4, pp 281-300, issn 0178-4617, 20 p.Article

Approximation Schemes for Node-Weighted Geometric Steiner Tree ProblemsREMY, Jan; STEGER, Angelika.Algorithmica. 2009, Vol 55, Num 1, pp 240-267, issn 0178-4617, 28 p.Conference Paper

Models and Branch-and-Cut Algorithms for the Steiner Tree Problem with Revenues, Budget and Hop ConstraintsCOSTA, Alysson M; CORDEAU, Jean-Francois; LAPORTE, Gilbert et al.Networks (New York, NY). 2009, Vol 53, Num 2, pp 141-159, issn 0028-3045, 19 p.Article

An algorithmic framework for the exact solution of the prize-collecting steiner tree problemLJUBIC, Ivana; WEISKIRCHER, René; PFERSCHY, Ulrich et al.Mathematical programming. 2006, Vol 105, Num 2-3, pp 427-449, issn 0025-5610, 23 p.Article

The Existence Problem for Steiner Networks in Strictly Convex DomainsFREIRE, Alexandre.Archive for rational mechanics and analysis. 2011, Vol 200, Num 2, pp 361-404, issn 0003-9527, 44 p.Article

On the full and bottleneck full Steiner tree problemsYEN HUNG CHEN; CHIN LUNG LU; CHUAN YI TANG et al.Lecture notes in computer science. 2003, pp 122-129, issn 0302-9743, isbn 3-540-40534-8, 8 p.Conference Paper

On the approximability of the steiner tree problemTHIMM, Martin.Lecture notes in computer science. 2001, pp 678-689, issn 0302-9743, isbn 3-540-42496-2Conference Paper

Vertex-distinguishing edge-colorings of 2-regular graphsWITTMANN, P.Discrete applied mathematics. 1997, Vol 79, Num 1-3, pp 265-277, issn 0166-218XArticle

A primal-dual approximation algorithm for the Steiner forest problemRAVI, R.Information processing letters. 1994, Vol 50, Num 4, pp 185-189, issn 0020-0190Article

Tree polytope on 2-treesMARGOT, F; PRODON, A; LIEBLING, T. M et al.Mathematical programming. 1994, Vol 63, Num 2, pp 183-191, issn 0025-5610Article

Practical partitioning-based methods for the steiner problemPOLZIN, Tobias; VAHDATI DANESHMAND, Siavash.Lecture notes in computer science. 2006, pp 241-252, issn 0302-9743, isbn 3-540-34597-3, 1Vol, 12 p.Conference Paper

Parallel Delaunay refinement with off-centersSPIELMAN, Daniel A; TENG, Shang-Hua; ÜNGÖR, Alper et al.Lecture notes in computer science. 2004, pp 812-819, issn 0302-9743, isbn 3-540-22924-8, 8 p.Conference Paper

A novel analog layout synthesys toolLIHONG ZHANG; KLEINE, Ulrich.IEEE International Symposium on Circuits and Systems. 2004, pp 101-104, isbn 0-7803-8251-X, 4 p.Conference Paper

Preprocessing steiner problems from VLSI layoutUCHOA, Eduardo; DE ARAGAO, Marcus Poggi; RIBEIRO, Celso C et al.Networks (New York, NY). 2002, Vol 40, Num 1, pp 38-50, issn 0028-3045Article

The Steiner number of a graphCHARTRAND, Gary; PING ZHANG.Discrete mathematics. 2002, Vol 242, Num 1-3, pp 41-54, issn 0012-365XArticle

On finding two-connected subgraphs in planar graphsPROVAN, J. S.Operations research letters. 1997, Vol 20, Num 2, pp 81-84, issn 0167-6377Article

Thirty-five-point rectilinear Steiner minimal trees in a daySALOWE, J. S; WARME, D. M.Networks (New York, NY). 1995, Vol 25, Num 2, pp 69-87, issn 0028-3045Article

Algorithms for terminal steiner treesVIDUANI MARTINEZ, Fabio; COELHO DE PINA, José; SOARES, José et al.Lecture notes in computer science. 2005, pp 369-379, issn 0302-9743, isbn 3-540-28061-8, 11 p.Conference Paper

Approximating Steiner trees in graphs with restricted weightsHALLDORSSON, M. M; UENO, S; NAKAO, H et al.Networks (New York, NY). 1998, Vol 31, Num 4, pp 283-292, issn 0028-3045Article